package main.java.indi.zyj.coderecord;

public class MinCostClimbingStairs {

    /**
     * @Description
     * @param cost
     * @return int
     * @author zyj
     * @date 2024/04/09 09:12
     */

    public int minCostClimbingStairs(int[] cost) {

        int n = cost.length;
        int[] dp = new int[n];

        dp[0] = 0; dp[1] = 0;

        for (int i = 2; i < n; ++i) {
            dp[i] = Math.min((dp[i - 1] + cost[i - 1]), (dp[i - 2] + cost[i - 2]));
        }
        return dp[n - 1];

    }

}
